Concurrency Control for Mixed Transactions in Real-Time Databases
نویسندگان
چکیده
ÐMany recent studies [8], [10] have suggested that the optimistic concurrency control (OCC) protocols outperform the locking-based protocols in real-time database systems (RTDBS). However, the OCC protocols suffer from the problem of unnecessary transaction restarts that is detrimental to transactions meeting their deadlines. The problem is more intensified in mixed transaction environments where both hard and firm real-time transactions exist. Firm transactions are more vulnerable to restarts when they are in conflict with hard transactions on data access. In this paper, we have addressed the problem and devised an effective OCC protocol with dynamic adjustment of serialization order (DASO), called OCC-DA, for RTDBS with mixed transactions. This protocol can avoid unnecessary transaction restarts by dynamically adjusting the serialization order of the conflicting transactions with respect to the validating transaction. As a result, much resource can be saved and more firm transactions can meet their deadlines without affecting the execution of hard transactions. The characteristics of the OCC-DA protocol have been examined in detail by simulation. The results show that the performance of the OCC-DA protocol is consistently better than the other two popular protocols, OCC with forward validation and OCC with Wait-50, over a wide range of system settings. In particular, the OCC-DA protocol provides a more significant performance gain in mixed transaction environments. Index TermsÐReal-time databases, optimistic concurrency control, serialization order adjustment, mixed transactions.
منابع مشابه
Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملLocking Based Concurrency Control for Integrated Real-Time Database Systems
In many database applications, incoming transactions are a mixed load of conventional (non real-time) and real-time (typically soft and rm) transactions. In this environment, transactions can even be changed dynamically from non real-time to soft or rm, or from soft to rm deadline transactions according to their execution paths. In this paper we show how lock based approach can handle these sit...
متن کاملThe Reduced Ceiling Protocol for Concurrency Control in Real-time Databases with Mixed Transactions
This paper proposes a real-time concurrency control protocol called Reduced Ceiling Protocol (RCP) for real-time database systems (RTDBS) consisting of hard and soft real-time transactions. The schedulability of hard real-time transactions can be improved by bounding the blocking time from soft real-time transactions. Different concurrency control strategies are proposed to resolve data conflic...
متن کاملResolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-Time Databases
We propose a multiversion concurrency control algorithm for real-time databases. Based on a priority cognitive algorithm commonly used in real-time processing, the proposed algorithm resolves data connicts among transactions in favor of the urgent transactions, i.e., those with higher priority. Our algorithm increases the degree of transaction concurrency while minimizing the transactions that ...
متن کاملHybrid Concurrency Control Method in Firm Real-Time Databases
Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems. Traditional concurrency control methods use serializability as the correctness criterion when transactions are executed concurrently. However, strict serializability as the correctness criterion is not always s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 51 شماره
صفحات -
تاریخ انتشار 2002